|
A hypertree network is a network topology that shares some traits with the binary tree network.〔"Parallel Programming in C with MPI and OpenMP", by Michael J. Quinn, (pp.31, 32 )〕 It is a variation of the fat tree architecture.〔 A hypertree of degree ''k'' depth ''d'' may be visualized as a 3-dimensional object whose front view is the top-down complete k-ary tree of depth ''d'' and the side view is the bottom-up complete binary tree of depth ''d''.〔 Hypertrees were proposed in 1981 by James R. Goodman and Carlo Sequin.〔Goodman, J.R.,Sequin, C.H. " Hypertree: A Multiprocessor Interconnection Topology", ''IEEE Transactions on Computers,'' vol. 20, no. 12, 1981, pp. 923-933, 〕 Hypertrees are a choice for parallel computer architecture, used, e.g., in the connection machine CM-5.〔Mengjou Lin, Rose Tsang, David H. C. Du. Alan E. Klietz and Stephen Saroff, "Performance Evaluation of the CM-5 Interconnection Network", ''Compcon'' ( ACM/IEEE conference on Supercomputing), Spring'93, Digest of Papers, 1993, pp. 189-198〕〔C. E. Leiserson, Z. S. Abuhamdeh, D. C. Douglas, C. R. Feynman, M. N. Ganmukhi, J. V. Hill, W. D. Hillis, B. C. Kuszmaul, M. A. St. Pierre, D. S. Wells, M. C. Wong, S Yang, R. Zak. "The network architecture of the connection machine CM-5". In" Proceeding of Parallel Algorithms and Architectures Symposium'': June 29 - July 1, 1992.〕 ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hypertree network」の詳細全文を読む スポンサード リンク
|